Harmonic analysis for graph refinements and the continuous graph FFT

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

on the harmonic index of graph operations

‎the harmonic index of a connected graph $g$‎, ‎denoted by $h(g)$‎, ‎is‎ ‎defined as $h(g)=sum_{uvin e(g)}frac{2}{d_u+d_v}$‎ ‎where $d_v$ is the degree of a vertex $v$ in g‎. ‎in this paper‎, ‎expressions for the harary indices of the‎ ‎join‎, ‎corona product‎, ‎cartesian product‎, ‎composition and symmetric difference of graphs are‎ ‎derived‎.

متن کامل

The graph spectrum of barycentric refinements

Given a finite simple graph G, let G1 be its barycentric refinement: it is the graph in which the vertices are the complete subgraphs of G and in which two such subgraphs are connected, if one is contained into the other. If λ0 = 0 ≤ λ1 ≤ λ2 ≤ · · · ≤ λn are the eigenvalues of the Laplacian of G, define the spectral function F (x) = λ[nx] on the interval [0, 1], where [r] is the floor function ...

متن کامل

Some Graph Polynomials of the Power Graph and its Supergraphs

‎In this paper‎, ‎exact formulas for the dependence‎, ‎independence‎, ‎vertex cover and clique polynomials of the power graph and its‎ ‎supergraphs for certain finite groups are presented‎.

متن کامل

Refinements and Modules for Typed Graph Transformation Systems

Spatial and temporal reenement relations between typed graph transformation systems have been introduced in 6, 7]. In a spatial reenement each rule is reened by an amalgamation of rules while in a temporal reenement it is reened by a sequence of rules: in both cases, the reenement relation supports the modeling of implementation. In the rst part of this paper, we further investigate the propert...

متن کامل

groups for which the noncommuting graph is a split graph

the noncommuting graph $nabla (g)$ of a group $g$ is asimple graph whose vertex set is the set of noncentral elements of$g$ and the edges of which are the ones connecting twononcommuting elements. we determine here, up to isomorphism, thestructure of any finite nonabeilan group $g$ whose noncommutinggraph is a split graph, that is, a graph whose vertex set can bepartitioned into two sets such t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2009

ISSN: 0024-3795

DOI: 10.1016/j.laa.2008.12.035